Undecidable fragments of elementary theories
نویسنده
چکیده
We introduce a general framework to prove undecidability of fragments. This is applied to fragments of theories arising in algebra and recursion theory. For instance, the V3V-theories of the class of finite distributive lattices and of the p.o. of recursively enumerable many-one degrees are shown to be undecidable.
منابع مشابه
Some new results on decidability for elementary algebra and geometry
We carry out a systematic study of decidability for theories of (a) real vector spaces, inner product spaces, and Hilbert spaces and (b) normed spaces, Banach spaces and metric spaces, all formalised using a 2-sorted first-order language. The theories for list (a) turn out to be decidable while the theories for list (b) are not even arithmetical: the theory of 2-dimensional Banach spaces, for e...
متن کاملComplete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas based on heuristics, which is not refutationally complete even for pure first-order logic. We present several decidable fragments of first order logic modulo theories. We show how to construct models for satisfiable ...
متن کاملComplete instantiation for quantified formulas in Satisfiability Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas based on heuristics, which is not refutationally complete even for pure first-order logic. We present several decidable fragments of first order logic modulo theories. We show how to construct models for satisfiable ...
متن کاملDefinability within structures related to
Let Sq denote the set of squares, and let SQn be the squaring function restricted to powers of n; let ⊥ denote the coprimeness relation. Let Bn(x, y) = (x+y x ) MOD n. For every integer n ≥ 2 addition and multiplication are definable in the structures 〈N;Bn,⊥〉 and 〈N;Bn,Sq〉; thus their elementary theories are undecidable. On the other hand, for every prime p the elementary theory of 〈N;Bp,SQp〉 ...
متن کاملInterpretation of the Arithmetic in Certain Groups of Piecewise Affine Permutations of an Interval Tuna Altinel and Alexey Muranov
The Arithmetic is interpreted in all the groups of Richard Thompson and Graham Higman, as well as in other groups of piecewise affine permutations of an interval which generalize the groups of Thompson and Higman. In particular, the elementary theories of all these groups are undecidable. Moreover, Thompson’s group F and some of its generalizations interpret the Arithmetic without parameters.
متن کامل